Generalization Regions in Hamming Negative Selection
نویسندگان
چکیده
Negative selection is an immune-inspired algorithm which is typically applied to anomaly detection problems. We present an empirical investigation of the generalization capability of the Hamming negative selection, when combined with the r-chunk affinity metric. Our investigations reveal that when using the rchunk metric, the length r is a crucial parameter and is inextricably linked to the input data being analyzed. Moreover, we propose that input data with different characteristics, i.e. different positional biases, can result in an incorrect generalization effect.
منابع مشابه
On Permutation Masks in Hamming Negative Selection
Abstract. Permutation masks were proposed for reducing the number of holes in Hamming negative selection when applying the r-contiguous or r-chunk matching rule. Here, we show that (randomly determined) permutation masks re-arrange the semantic representation of the underlying data and therefore shatter self-regions. As a consequence, detectors do not cover areas around self regions, instead th...
متن کاملPrivacy-Preserving Evaluation of Generalization Error and Its Application to Model and Attribute Selection
Privacy-preserving classification is the task of learning or training a classifier on the union of privately distributed datasets without sharing the datasets. The emphasis of existing studies in privacy-preserving classification has primarily been put on the design of privacy-preserving versions of particular data mining algorithms, However, in classification problems, preprocessing and postpr...
متن کاملGeneralized Asymmetrical Bidirectional Associative Memory*
A classical bidirectional associative memory (BAM) suffers from low storage capacity and abundance of spurious memories though it has the properties of good generalization and noise immunity. In this paper, Hamming distance in recall procedure of usual asymmetrical BAM is replaced with modified Hamming distance by introducing weighting matrix into connection matrix. This generalization is valid...
متن کاملLogic Synthesis via Hamming Clustering
The synthesis of digital circuits for the solution of binary classification problems is performed by employing a new learning method, named Hamming Clustering: it proceeds by generating clusters of input patterns that belong to the same class and are close each other according to the Hamming distance. In polynomial time, a digital circuit is obtained, neglecting redundant inputs irrelevant to t...
متن کاملApplication of the feature-detection rule to the Negative Selection Algorithm
The Negative Selection Algorithm developed by Forrest et al. was inspired by the way in which T-cell lymphocytes mature within the thymus before being released into the blood system. The mature T-cell lymphocytes exhibit an interesting characteristic, in that they are only activated by non-self cells that invade the human body. The Negative Selection Algorithm utilises an affinity matching func...
متن کامل